On Scheduling Problems with Forbidden Stack-Overflows
نویسندگان
چکیده
منابع مشابه
On-line scheduling with forbidden zones
In various manufacturing and computing contexts there may be a certain period in each time interval, during which processing may continue but may not be initiated. We examine the problem of on-line scheduling in the presence of such forbidden zones, whose complements are starting time windows. We show that no on-line algorithm is better than 9 7 competitive, when minimizing the number of interv...
متن کاملStack-Based Buffer Overflows in Harvard Class Embedded Systems
Many embedded devices used to control critical infrastructure assets are based on the Harvard architecture. This architecture separates data and program memory into independent address spaces, unlike the von Neumann architecture, which uses a single address space for data and program code. Buffer overflow attacks in desktop and server platforms based on the von Neumann model have been studied e...
متن کاملSTACKFENCES: A Run-Time Approach for Detecting Stack Overflows
This paper describes StackFences, a run-time technique for detecting overflows in local variables in C programs. This technique is different from all others developed so far because it tries to detect explicit overflow occurrences, instead of detecting if a particular stack value, namely a return address, was corrupted because of a stack overflow. Thus, StackFences is useful not only for detect...
متن کاملSingle machine scheduling with forbidden start times
This paper addresses a single machine scheduling problem in which the following simple constraint is added: a set of time slots is forbidden for starting a task, that is no task can start at any forbidden time point. We show that the single machine problem with makespan minimization is strongly NP-complete and we give polynomial algorithms to solve the problems with a small number of forbidden ...
متن کاملA note on center problems with forbidden polyhedra
The problem of nding an optimal location X minimizing the maximum Euc-lidean distance to existing facilities is well solved by e.g.the Elzinga-Hearn algorithm. In practical situations X will however often not be feasible. We therefore suggest in this note a polynomial algorithm which will nd an optimal location X F in a feasible subset F IR 2 of the plane.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.139